Orbit complexity, initial data sensitivity and weakly chaotic dynamical systems

نویسنده

  • Stefano Galatolo
چکیده

We give a definition of generalized indicators of sensitivity to initial conditions and orbit complexity (a measure of the information that is necessary to describe the orbit of a given point). The well known Ruelle-Pesin and Brin-Katok theorems, combined with Brudno’s theorem give a relation between initial data sensitivity and orbit complexity that is generalized in the present work. The generalized relation implies that the set of points where the sensitivity to initial conditions is more than exponential in all directions is a 0 dimensional set. The generalized relation is then applied to the study of an important example of weakly chaotic dynamics: the Manneville map.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information, initial condition sensitivity and dimension in weakly chaotic dynamical systems

We study generalized indicators of sensitivity to initial conditions and orbit complexity in topological dynamical systems. The orbit complexity is a measure of the asymptotic behavior of the information that is necessary to describe the orbit of a given point. The indicator generalizes, in a certain sense, the Brudno’s orbit complexity (which is strongly related to the entropy of the system). ...

متن کامل

Global and local Complexity in weakly chaotic dynamical systems

In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We consider this indicator of local complexity of the dynamics and provide different examples of its behavior, showing how it can be useful to characterize vari...

متن کامل

Recurrence and algorithmic information

In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.

متن کامل

Sensitivity Analysis of Coupled Chaotic Dynamical Systems with the Pseudo-Orbit Tracing Property

This paper focuses on the sensitivity analysis of coupled nonlinear dynamical systems, which under certain conditions exhibit the chaotic behavior. Sensitivity functions calculated via conventional methods of sensitivity analysis are inherently uninformative and inconclusive. The use of the pseudo-orbit shadowing property in dynamical systems allows calculating sensitivity functions correctly a...

متن کامل

A Novel Method for Detection of Epilepsy in Short and Noisy EEG Signals Using Ordinal Pattern Analysis

Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008